Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diameter
نویسندگان
چکیده
منابع مشابه
Decompositions of Complete Graphs into Factors with Diameter Two
In the present paper the question is studied from three points of vieAv whether to any natural number k _> 2 there exists a complete graph decomposable into k factors with diameters two . The affirmative answer to this question is given and some estimations for the minimal possible number of vertices of such a complete graph are deduced . As a corollary it follows that given k diameters di, d2 ...
متن کاملDecomposition of complete graphs into factors of diameter two and three
We analyze a minimum number of vertices of a complete graph that can be decomposed into one factor of diameter 2 and k factors of diameter at most 3. We find exact values for k ≤ 4 and the asymptotic value of the ratio of this number and k when k tends to infinity. We also find the asymptotic value of the ratio of the number of vertices of the smallest complete graph that can be decomposed into...
متن کاملOn Cyclic Decompositions of Complete Graphs into Tripartite Graphs
We introduce two new labelings for tripartite graphs and show that if a graph G with n edges admits either of these labelings, then there exists a cyclic G-decomposition of K2nx+1 for every positive integer x. We also show that if G is the union of two vertext-disjoint cycles of odd length, other than C3 ∪ C3, then G admits one of these labelings.
متن کاملFactorizations of the complete graphs into factor of subdiameter two and factors of diameter three
We search for the minimal number of vertices of the complete graph that can be decomposed into one factor of subdiameter 2 and k factors of diameter 3. We find as follows: exact values for k ≤ 3, upper and lower bounds for small values of k and lim k→∞ φ (k) k = 2.
متن کاملDecomposition of cartesian products of regular graphs into isomorphic trees
We extend the ideas of Snevily and Avgustinovitch to enlarge the families of 2mregular graphs and m-regular bipartite graphs that are known to decompose into isomorphic copies of a tree T with m edges. For example, consider r1, . . . , rk with ∑k i=1 ri = m. If T has a k-edge-coloring with ri edges of color i such that every path in T uses some color once or twice, then every cartesian product ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.02.009